Exponential Bounds for Noncommuting Systems
نویسندگان
چکیده
It is shown that a nite system T of matrices whose real linear combinations have real spectrum satisses a bound of the form ke ihT;;i k C(1 + jj) s e rj=j. The proof appeals to the monogenic functional calculus.
منابع مشابه
Stochastic Comparisons of Series and Parallel Systems with Heterogeneous Extended Generalized Exponential Components
In this paper, we discuss the usual stochastic‎, ‎likelihood ratio, ‎dispersive and convex transform order between two parallel systems with independent heterogeneous extended generalized exponential components. ‎We also establish the usual stochastic order between series systems from two independent heterogeneous extended generalized exponential samples. ‎Finally, ‎we f...
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملNoncommuting observables in quantum detection and estimation theory
In quantum detection theory the optimum detection operators must commute; admitting simultaneous approximate measurement of noncommuting observables cannot yield a lower Bayes cost. The lower bounds on mean square errors of parameter estimates predicted by the quantum-mechanical Cramer-Rao inequality can also not be reduced by such means.
متن کاملExponential Bounds with Applications
In this paper we develop a framework for computing upper and lower bounds of an exponential form for a large class of single resource systems with Markov additive inputs. Speciically, the bounds are on quantities such as backlog, queue length, and response time. Explicit or computable expressions for our bounds are given in the context of queueing theory and numerical comparisons with other bou...
متن کاملExponential Bounds with Applications Tocall
In this paper we develop a framework for computing upper and lower bounds of an exponential form for a large class of single resource systems with Markov additive inputs. Speciically, the bounds are on quantities such as backlog, queue length, and response time. Explicit or computable expressions for our bounds are given in the context of queueing theory and numerical comparisons with other bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998